/**
 * Copyright 2022-2023 Huawei Technologies Co., Ltd
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

#ifndef MINDSPORE_CCSRC_BACKEND_OPTIMIZER_GRAPH_KERNEL_CORE_VALUE_DEPEND_OP_UTILS_H_
#define MINDSPORE_CCSRC_BACKEND_OPTIMIZER_GRAPH_KERNEL_CORE_VALUE_DEPEND_OP_UTILS_H_

#include <memory>
#include <string>
#include <unordered_map>

#include "base/base.h"
#include "ir/anf.h"
#include "ir/func_graph.h"
#include "utils/hash_set.h"

namespace mindspore::graphkernel {
class ValueDependOpUtils {
 public:
  static bool IsConstInput(const AnfNodePtr &node);
  static bool AddConstInputToAttr(const CNodePtr &cnode, const HashSet<size_t> &input_idx);
  static bool KeepValueNode(const std::string &prim_name, size_t index) {
    auto iter = GetOpIndexInfo().find(prim_name);
    return iter != GetOpIndexInfo().end() && iter->second.count(index) != 0;
  }
  static const HashSet<size_t> &GetIndices(const std::string &prim_name) {
    auto iter = GetOpIndexInfo().find(prim_name);
    return iter->second;
  }

  static const std::unordered_map<std::string, HashSet<size_t>> &GetOpIndexInfo();
};
}  // namespace mindspore::graphkernel
#endif  // MINDSPORE_CCSRC_BACKEND_OPTIMIZER_GRAPH_KERNEL_CORE_VALUE_DEPEND_OP_UTILS_H_
